A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games
نویسندگان
چکیده
It is shown that the discount factor needed to solve an undiscounted mean payoff stochastic game to optimality is exponentially close to 1, even in games with a single random node and polynomially bounded rewards and transition probabilities.
منابع مشابه
A TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کاملCanonical forms of two-person zero-sum limit average payoff stochastic games
We consider two-person zero-sum stochastic games with perfect information and, for each k ∈ Z+, introduce a new payoff function, called the k-total reward. For k = 0 and 1 they are the so called mean and total rewards, respectively. For all k, we prove solvability of the considered games in pure stationary strategies, and show that the uniformly optimal strategies for the discounted mean payoff...
متن کاملGames through Nested Fixpoints
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consider total-payoff games which have been introduced as a refinement of mean-payoff games [18, 10]. In the stochastic setting, our class is a turn-based variant of liminf-payoff games [15, 16, 4]. In both settings, we pro...
متن کاملOn the computational complexity of solving stochastic mean-payoff games
We consider some well known families of two-player, zero-sum, turn-based, perfect information games that can be viewed as specical cases of Shapley’s stochastic games. We show that the following tasks are polynomial time equivalent: • Solving simple stochastic games, • solving stochastic mean-payoff games with rewards and probabilities given in unary, and • solving stochastic mean-payoff games ...
متن کاملA Potential Reduction Algorithm for Ergodic Mean Payoff Stochastic Games with Perfect Information
In this paper, we consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB ∪ VW ∪ VR, E), with local rewards r : E → R, and three types of vertices: black VB, white VW , and random VR. The game is played by two players, White and Black: When the play is at a white (black) vertex v, White (Black) selects an outgoing arc (v, ...
متن کامل